L-shaped Algorithm for Stochastic Disassembly Line Balancing Problem
نویسندگان
چکیده
منابع مشابه
A New U-Shaped Heuristic for Disassembly Line Balancing Problems
The product recovery operations are fully based on disassembly line balancing. The disassembly line is a best chaise of automated disassembly or returned product. It is very difficult to find the optimal balance of a disassembly line because of its N-P hard nature. In this paper a new U-shaped heuristic is proposed to assign the parts to the disassembly work stations under precedence constraint...
متن کاملA balancing method and genetic algorithm for disassembly line balancing
Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassembly of returned products. It is therefore important that the disassembly line be designed and balanced so that it works as efficiently as possible. The disassembly line balancing problem seeks a sequence which: is feasi...
متن کاملComplications in Disassembly Line Balancing
Disassembly line is, perhaps, the most suitable way for the disassembly of large products or small products in large quantities. In this paper, we address the disassembly line balancing problem (DLBP) and the challenges that come with it. The objective of balancing the disassembly line is to utilize the disassembly line in an optimized fashion while meeting the demand for the parts retrieved fr...
متن کاملA branch, price and remember algorithm for the U shaped assembly line balancing problem
In this paper we propose a branch, price and remember algorithm to solve the U shaped assembly line balancing problem. Our proposed algorithm uses a column generation approach to obtain tight lower bounds. It also uses a modification of Hoffman algorithm to obtain high quality upper bounds. Memory is also used in our proposed algorithm to store generated columns to enhance the speed of column g...
متن کاملSolving Sequence-dependent Disassembly Line Balancing Problem Using a Hybrid Genetic Algorithm
In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that requires the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly precedence constraints and optimizing the effectiveness of several measures considering sequence-dependent time increments. A hybrid genetic algorithm i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2013
ISSN: 1474-6670
DOI: 10.3182/20130619-3-ru-3018.00500